An electric log

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

15 صفحه اول

Reuse of Electric Motors in Consumer Products Design and Analysis of an Electronic Data Log

Product takeback calls for sound strategies of product recovery management. One such strategy is the reuse of the components of a product. There are consumer products such as power tools whose most expensive component, the electric motor, offers potential for reuse. Empirical evidence reveals that the lifetime of a motor often exceeds the lifetime of the product using it. This article focuses o...

متن کامل

Analyzing Log Analysis: An Empirical Study of User Log Mining

We present an in-depth study of over 200K log analysis queries from Splunk, a platform for data analytics. Using these queries, we quantitatively describe log analysis behavior to inform the design of analysis tools. This study includes state machine based descriptions of typical log analysis pipelines, cluster analysis of the most common transformation types, and survey data about Splunk user ...

متن کامل

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.

متن کامل

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science

سال: 1886

ISSN: 0036-8075,1095-9203

DOI: 10.1126/science.ns-8.189.256-a